- generating polynomial
- порождающий полином.
English-Russian cryptological dictionary . 2014.
Смотреть что такое "generating polynomial" в других словарях:
Generating function — This article is about generating functions in mathematics. For generating functions in classical mechanics, see Generating function (physics). For signalling molecule, see Epidermal growth factor. In mathematics, a generating function is a formal … Wikipedia
Generating trigonometric tables — In mathematics, tables of trigonometric functions are useful in a number of areas. Before the existence of pocket calculators, trigonometric tables were essential for navigation, science and engineering. The calculation of mathematical tables was … Wikipedia
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Complete homogeneous symmetric polynomial — In mathematics, specifically in algebraic combinatorics and commutative algebra, the complete homogeneous symmetric polynomials are a specific kind of symmetric polynomials. Every symmetric polynomial can be expressed as a polynomial expression… … Wikipedia
Q-difference polynomial — In combinatorial mathematics, the q difference polynomials or q harmonic polynomials are a polynomial sequence defined in terms of the q derivative. They are a type of Brenke polynomial, and generalize the Appell polynomials. See also Sheffer… … Wikipedia
Kazhdan–Lusztig polynomial — In representation theory, a Kazhdan–Lusztig polynomial P y,w ( q ) is a member of a family of integral polynomials introduced in work of David Kazhdan and George Lusztig Harv|Kazhdan|Lusztig|1979. They are indexed by pairs of elements y , w of a… … Wikipedia
Matching polynomial — In graph theory and combinatorics, both fields within mathematics, a matching polynomial (sometimes called an acyclic polynomial) is a generating function of the numbers of matchings of various sizes in a graph. Contents 1 Definition 2… … Wikipedia
Conway polynomial (finite fields) — In mathematics, the Conway polynomial Cp,n for the finite field Fpn is a particular irreducible polynomial of degree n over Fp that can be used to define a standard representation of Fpn as a splitting field of Fp. Conway polynomials were named… … Wikipedia
Gromov's theorem on groups of polynomial growth — In mathematics, Gromov s theorem on groups of polynomial growth, named for Mikhail Gromov, characterizes finitely generated groups of polynomial growth, as those groups which have nilpotentsubgroups of finite index. The growth rate of a group is… … Wikipedia
Dickson polynomial — In mathematics, the Dickson polynomials, denoted Dn(x,α), form a polynomial sequence studied by L. E. Dickson (1897). Over the complex numbers, Dickson polynomials are essentially equivalent to Chebyshev polynomials with a change of variable … Wikipedia
Rook polynomial — Despite its name, the rook polynomial is used not only to solve chess recreational problems but also in a number of problems arising in combinatorial mathematics, group theory, and number theory.The coefficients of the rook polynomial represent… … Wikipedia